#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=1e5;
typedef long long LL;
const LL mod=1e9+7;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL a[maxn];
LL ksm(LL a,LL k){
    LL res=1;
    while(k>0){
        if(k&1) res=res*a%mod;
        k>>=1;
        a=a*a%mod;
    }
    return res%mod;
}
int main(void)
{
  cin.tie(0);std::ios::sync_with_stdio(false);
  LL x,n;cin>>x>>n;
  LL tot=0;
  for(LL i=2;i<=sqrt(x);i++){
     if(x%i==0){
        a[++tot]=i;
        while(x%i==0) x/=i;
     }
  }
  if(x>1) a[++tot]=x;
  LL ans=1;
  for(LL i=1;i<=tot;i++){
      LL temp=n;LL cnt=0;
      while(temp>0){
        temp/=a[i];
        cnt+=temp;
      }
      ans=(ans%mod*ksm(a[i],cnt)%mod)%mod;
  }
  cout<<ans<<"\n";
return 0;
}
